@InProceedings{FabrisSilvForr:1997:EfFiAl,
               author = "Fabris, Antonio Elias and Silva, Luciano and Forrest, A. Robin",
                title = "An efficient filling algorithm for non-simple closed curves using 
                         the point containment paradigm",
            booktitle = "Proceedings...",
                 year = "1997",
               editor = "Figueiredo, Luiz Henrique de and Netto, Marcio Lobo",
                pages = "2--9",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 10. 
                         (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
                 note = "The conference was held in Campos de Jord{\~a}o, SP, Brazil, from 
                         October 13 to 16.",
             abstract = "The Point Containment predicate which specifies if a point is part 
                         of a mathematically defined shape or not is one of the most basic 
                         notions in raster graphics. This paper presents a technique to 
                         counteract the main disadvantage of Point Containment algorithms: 
                         their quadratic time complexity with increasing resolution. The 
                         implementented algorithm handles complex geometries such as 
                         self-intersecting closed curves.",
  conference-location = "Campos de Jord{\~a}o, SP, Brazil",
      conference-year = "Oct. 1997",
             language = "en",
         organisation = "SBC - Sociedade Brasileira de Computa{\c{c}}{\~a}o; USP - 
                         Universidade de S{\~a}o Paulo",
                  ibi = "83LX3pFwXQZW44Lb/d9sky",
                  url = "http://urlib.net/ibi/83LX3pFwXQZW44Lb/d9sky",
           targetfile = "art17.pdf",
        urlaccessdate = "2024, May 03"
}